Topology of technology graphs: Small world patterns in electronic circuits

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topology of technology graphs: small world patterns in electronic circuits.

Recent theoretical studies and extensive data analyses have revealed a common feature displayed by biological, social, and technological networks: the presence of small world patterns. Here we analyze this problem by using several graphs obtained from one of the most common technological systems: electronic circuits. It is shown that both analogic and digital circuits exhibit small world behavi...

متن کامل

analyzing patterns of classroom interaction in efl classrooms in iran

با به کار گیری روش گفتما ن شنا سی در تحقیق حا ضر گفتا ر میا ن آموزگا را ن و زبا ن آموزا ن در کلا سهای زبا ن انگلیسی در ایرا ن مورد بررسی قرار گرفت. ا هداف تحقیق عبا رت بودند از: الف) شنا سا ئی سا ختارهای ارتبا ط گفتا ری میا ن معلمین و زبا ن آموزا ن ب) بررسی تا ثیر نقش جنسیت دبیرا ن و زبا ن آموزان بر سا ختا رهای ارتبا ط گفتا ری میا ن آنها پ) مشخص کردن اینکه آ یا آموزگاران غا لب بر این ارتبا ط گف...

the tragedy of modern man in arthur millers world

what miller wants is a theatre of heightened consciousness. he speaks of two passions in a man, the passion to "feel" and the passion "know". he belives that we can have more of the latter. he says: drama is akin to the other inventions of man in that it ought to help us know more and not merely to spend our feelings. the writing of the crucible shows us that he is trying to give more heightene...

15 صفحه اول

The Kauffman model on Small-World Topology

We apply Kauffman’s automata on small-world networks to study the crossover between the short-range and the infinite-range case. We perform accurate calculations on square lattices to obtain both critical exponents and fractal dimensions. Particularly, we find an increase of the damage propagation and a decrease in the fractal dimensions when adding long-range connections.

متن کامل

An Alexandroff topology on graphs

Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersec- tion of every family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2001

ISSN: 1063-651X,1095-3787

DOI: 10.1103/physreve.64.046119